Integrating Termination and Abort-Freedom
نویسندگان
چکیده
The condition under which a computation terminates, and the question of whether a computation terminates for a given initial state, have been the focus of much interest since the early days of computing. In this paper we argue that it is advantageous to study the property of termination in conjunction with the property of abort-freedom, i.e. the property of a program to execute without raising exceptional conditions; also, we model the two properties in a single mathematical framework, and illustrate how this integrated framework gives a better outcome than the separate analysis of the two aspects.
منابع مشابه
SPEEDITY-A Real Time Commit Protocol
This paper presents Shadow, Piggy bag, Elemental External Dependency Inversion and in Time Yielding (SPEEDITY) commit protocol for distributed real time database systems (DRTDBS). Here, only abort dependent cohort having deadline greater than a specific value (Tshadow_creation_time) needs to forks off a replica of itself called a shadow, whenever it borrows dirty value of a data item. Commit-on...
متن کامل2-phase Commit Protocol
DEFINITION The 2-phase commit (2PC) protocol is a distributed algorithm to ensure the consistent termination of a transaction in a distributed environment. Thus, via 2PC an unanimous decision is reached and enforced among multiple participating servers whether to commit or abort a given transaction, thereby guaranteeing atomicity. The protocol proceeds in two phases, namely the prepare (or voti...
متن کاملComputing Termination Conditions of Iterative Programs
It is common to use invariant assertions to analyze functional properties of loops (such as partial correctness) and to use variant functions to analyze operational properties of loops (such as termination). In this paper, we explore an orthogonal approach, based on invariant relations, which enables us to reason about functional properties as well as termination in a uniform manner; also, our ...
متن کاملOptimal threshold policies in a two-class preemptive priority queue with admission and termination control
We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decis...
متن کاملReal-Time Orbiter Abort Guidance
This paper describes a real-time abort guidance algorithm which determines the time sequence of the powered maneuvers and the orientation of the thrust vector throughout an abort-mission action initiated during the orbiter ascent phase. It involves guiding a heavily loaded Space Shuttle vehicle, passing through severe environmental conditions, back to a designated landing area. A graphical exam...
متن کامل